The Generalized Quantum Database Search Algorithm

Experimental NMR Realization of A Generalized Quantum Search Algorithm

A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by π/2 phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked state with a smaller step compared to standard Grover algorithm. Phase matching requirement in quantum searching is demonstrated by comparing it with another gene...

Generalized Quantum Search Hamiltonian

There are hamiltonians that solve a search problem of finding one of N items in O( √ N) steps. They are hamiltonians to describe an oscillation between two states. In this paper we propose a generalized search hamiltonian, Hg. Then the known search hamiltonians become special cases of Hg. From the generalized search hamiltonian, we present remarkable results that searching with 100% is subject ...

Generalized Quantum Search with Parallelism

We generalize Grover’s unstructured quantum search algorithm to enable it to use an arbitrary starting superposition and an arbitrary unitary matrix simultaneously. We derive an exact formula for the probability of the generalized Grover’s algorithm succeeding after n iterations. We show that the fully generalized formula reduces to the special cases considered by previous authors. We then use ...

A Generalized Threats Search Algorithm

Generalized Search Trees for Database Systems

This paper introduces the Generalized Search Tree (GiST), an index structure supporting an extensible set of queries and data types. The GiST allows new data types to be indexed in a manner supporting queries natural to the types; this is in contrast to previous work on tree extensibility which only supported the traditional set of equality and range predicates. In a single data structure, the ...